Riffle shuffles of decks with repeated cards

نویسنده

  • Mark Conger
چکیده

By a well-known result of Bayer and Diaconis, the maximum entropy model of the common riffle shuffle implies that the number of riffle shuffles necessary to mix a standard deck of 52 cards is either 7 or 11 — with the former number applying when the metric used to define mixing is the total variation distance and the later when it is the separation distance. This and other related results assume all 52 cards in the deck to be distinct and require all 52! permutations of the deck to be almost equally likely for the deck to be considered well mixed. In many instances, not all cards in the deck are distinct and only the sets of cards dealt out to players, and not the order in which they are dealt out to each player, needs to be random. We derive transition probabilities under riffle shuffles between decks with repeated cards to cover some instances of the type just described. We focus on decks with cards all of which are labeled either 1 or 2 and describe the consequences of having a symmetric starting deck of the form 1, . . . , 1, 2 . . . , 2 or 1, 2, . . . , 1, 2. Finally, we consider mixing times for common card games. Short title: Shuffling decks with repeated cards.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Riffle Shuffles of a Deck with Repeated Cards

We study the Gilbert-Shannon-Reeds model for riffle shuffles and ask ’How many times must a deck of cards be shuffled for the deck to be in close to random order?’. In 1992, Bayer and Diaconis gave a solution which gives exact and asymptotic results for all decks of practical interest, e.g. a deck of 52 cards. But what if one only cares about the colors of the cards or disregards the suits focu...

متن کامل

O ct 1 99 9 Affine shuffles , shuffles with cuts , and patience sorting

Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group Sn are different, they both satisfy a convolution property. Strong evidence is given that when the underlying parameter q satisfies gcd(n, q−1) = 1, the induced measures on conjugacy classes of the symmetric group coincide. This gives rise to interesting combina...

متن کامل

Affine Shuffles, Shuffles with Cuts, and Patience Sorting

Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group Sn are different, they both satisfy a convolution property. Strong evidence is given that when the underlying parameter q satisfies gcd(n, q−1) = 1, the induced measures on conjugacy classes of the symmetric group coincide. This gives rise to interesting combina...

متن کامل

Shuffling Cards for Blackjack, Bridge, and Other Card Games

This paper is about the following question: How many riffle shuffles mix a deck of card for games such as blackjack and bridge? An object that comes up in answering this question is the descent polynomial associated with pairs of decks, where the decks are allowed to have repeated cards. We prove that the problem of computing the descent polynomial given a pair of decks is #P -complete. We also...

متن کامل

Randomization Time for the Overhand Shuffle

1. THE OVERHAND SHUFFLE (~o The two most common methods of shuffling a deck of playing cards are the riffle shuffle and the overhand shuffle. The riffle shuffle is performed by splitting the deck into two halves and interlacing them. Aldous and Diaconis have shown in Ref. I that approximately 2 log N riffle shuffles suffices to randomize a deck (the meaning of this will be made more precise bel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005